Direct Solutions of Sparse Network Equations by Optimally Ordered Triangular Factorization

algebraic systems” (translated by G. J. Tee), Computer Science Dept., Stanford University, Stanford, Calif., Tech. Rept. CS24, 1965. [291 N. Sato and W. F. Tinney, “Techniques for exploiting the sparsity of the network admittance matrix,’’ IEEE Trans. Power and Apparatus, vol. 82, pp. 944-950, December 1963. I 3 O 1 W. F. Tinney and J. W. Walker, “Direct solutions of sparse network equations by optimally ordered triangular factorization,” this issue, p. 1801. S. Parter, “The use of linear graphs in gauss elimination,” SIAM Rev., vol. 3, pp. 119-130, April 1961. [321 D. Bree, Jr., “Some remarks on the application of graph theory to the solution of sparse systems of linear equations,” thesis, Dept. of Math., Princeton University, Princeton, N. J., May 1965. ‘’’I A. Orden, “Matrix inversion and related topics by direct methods,” in Mathematical Methods for Digital Computers, A. Ralston and H. S. Wilf, Eds. New York: Wiley, 1960, ch. 2. [341 F. B. Hildebrand, Introduction to Numerical Analysis. New York: McGraw-Hill, 1956. 1351 C. G. Broyden, “A class of methods for solving nonlinear simultaneous equations,” Math. Comp., vol. 19, pp. 577-593, October 1965.